Real and complex fast Fourier transforms on the Fujitsu VPP 500
نویسندگان
چکیده
منابع مشابه
Parallel Eigenvalue Routines on the Fujitsu VPP 300
As part of the Fujitsu-ANU Parallel Mathematical Subroutine Library Project we have developed a suite of parallel eigenvalue decomposition routines to handle a variety of input matrices. For a dense real symmetric matrix there are routines using the Jacobi algorithm and routines which rst reduce the symmetric matrix to tridiagonal form. All algorithms have been developed to fully exploit the ve...
متن کاملFast Fourier Transforms
29 O(b log(b)) operations (using standard multiplication). As there are O(b= log(b)) primes in total, the running time of this stage of the algorithm is O(b 2 L), even using the \grammar school" method of integer multiplication. At this stage of the algorithm we have obtained a vector of length L whose entries are integral linear combinations of powers of with coeecients bounded by M in absolut...
متن کاملDimensionless Fast Fourier Transforms
This paper shows that there are fast Fourier transform (FFT) algorithms that work, for a fixed number of points, independent of the dimension. Changing the dimension is achieved by relabeling the input and the output and changing the “twiddle factors.” An important consequence of this result, is that a program designed to compute the 1-dimensional Fourier transform can be easily modified to com...
متن کاملFourier Transforms and the Fast Fourier Transform ( FFT ) Algorithm
and the inverse Fourier transform is f (x) = 1 2π ∫ ∞ −∞ F(ω)e dω Recall that i = √−1 and eiθ = cos θ+ i sin θ. Think of it as a transformation into a different set of basis functions. The Fourier transform uses complex exponentials (sinusoids) of various frequencies as its basis functions. (Other transforms, such as Z, Laplace, Cosine, Wavelet, and Hartley, use different basis functions). A Fo...
متن کاملFFTS ON THE VPP 500 3 Platform FFT performance rFFT
Fast Fourier transforms parallelize well but need large amounts of communication. An algorithm which concentrates all the communication in one or two transposition steps is the transpose split algorithm. Di erent transposition algorithms can be used depending on data size and communication latency. A new transpose split algorithm for real and hermitian data is presented for one, two and three d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 1996
ISSN: 0167-8191
DOI: 10.1016/0167-8191(96)00015-4